Relational Learning with Decision Trees
نویسندگان
چکیده
In this paper, we describe two different learning tasks for relational structures. When learning a classifier for structures, the relational structures in the training sets are classified as a whole. Contrarily, when learning a context dependent classifier for elementary objects, the elementary objects of the relational structures in the training set are classified. We investigate the question how such classifications can be induced automatically from a given training set containing classified structures or classified elementary objects respectively. We present an algorithm based on fast graph isomorphism testing that allows the description of the objects in the training set by automatically constructed attributes. This allows us to employ wellknown methods of decision tree induction to construct a hypothesis. We describe new simplification and structure reconstruction techniques for the learned structural decision tree. We present the system INDIGO and evaluate it on the Mesh and the Mutagenicity Data.
منابع مشابه
Ensemble-Roller: Planning with Ensemble of Relational Decision Trees
In this paper we describe the ENSEMBLE-ROLLER planner submitted to the Learning Track of the International Planning Competition (IPC). The planner uses ensembles of relational classifiers to generate robust planning policies. As in other applications of machine learning, the idea of the ensembles of classifiers consists of providing accuracy for particular scenarios and diversity to cover a wid...
متن کاملTop-down induction of logical decision trees
Top-down induction of decison trees (TDIDT) is a very popular machine learning technique. Up till now, it has mainly used for propositional learning, but seldomly for relational learning or inductive logic programming. The main contribution of this paper is the introduction of logic decision trees, which make it possible to use TDIDT in inductive logic programming. An implementation of this top...
متن کاملLearning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computation effort. On the contrary, where this is not true, heuristics planners compute loads of useless node evaluations that make them scale-up poorly. In this paper we present a novel approach for boosting the scalability ...
متن کاملLearning Actions: Induction over Spatio-Temporal Relational Structures - CRG
We introduce a rule-based approach for learning and recognition of complex actions in terms of spatio-temporal attributes of primitive event sequences. During learning, spatio-temporal decision trees are generated that satisfy relational constraints of the training data. The resulting rules, in form of Horn clause descriptions, are used to classify new dynamic pattern fragments, and general heu...
متن کاملA Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probability trees have been proposed but no thorough comparison of these approaches exists. In this paper we experimentally compare the main approaches using the relational decision tree learner Tilde (both on non-relational and ...
متن کاملReMauve: A Relational Model Tree Learner
Model trees are a special case of regression trees in which linear regression models are predicted in the leaves. Little attention has been paid to model trees in relational learning, mainly because the task of learning linear regression equations in this context involves dealing with nondeterminacy of predictive attributes. Whereas existing approaches handle this non-determinacy issue either b...
متن کامل